Minimum Span of No-Hole (r+1)-Distant Colorings
نویسندگان
چکیده
منابع مشابه
Minimum Span of No-Hole (r+1)-Distant Colorings
Given a nonnegative integer r, a no-hole (r+1)-distant coloring, called Nr-coloring, of a graph G is a function that assigns a nonnegative integer (color) to each vertex such that the separation of the colors of any pair of adjacent vertices is greater than r, and the set of the colors used must be consecutive. Given r and G, the minimum Nr-span of G, nspr(G), is the minimum difference of the l...
متن کاملNo-hole 2-distant colorings for Cayley graphs on finitely generated abelian groups
A no-hole 2-distant coloring of a graph is an assignment c of nonnegative integers to the vertices of such that |c(v)−c(w)| 2 for any two adjacent vertices v and w, and the integers used are consecutive. Whenever such a coloring exists, define nsp( ) to be the minimum difference (over all c) between the largest and smallest integers used. In this paper we study the no-hole 2-distant coloring pr...
متن کاملNo-hole L(2, 1)-colorings
An L(2, 1)-coloring of a graph G is a coloring of G’s vertices with integers in {0, 1, . . . , k} so that adjacent vertices’ colors differ by at least two and colors of distance-two vertices differ. We refer to an L(2, 1)-coloring as a coloring. The span λ(G) of G is the smallest k for which G has a coloring, a span coloring is a coloring whose greatest color is λ(G), and the hole index ρ(G) of...
متن کاملMinimum sum edge colorings of multicycles
In the minimum sum edge coloring problem, we aim to assign natural numbers to edges of a graph, so that adjacent edges receive different numbers, and the sum of the numbers assigned to the edges is minimum. The chromatic edge strength of a graph is the minimum number of colors required in a minimum sum edge coloring of this graph. We study the case of multicycles, defined as cycles with paralle...
متن کاملEdge-Colorings with No Large Polychromatic Stars
Given a graph G and a positive integer r, let f r (G) denote the largest number of colors that can be used in a coloring of E(G) such that each vertex is incident to at most r colors. For all positive integers n and r, we determine f r (K n;n) exactly and f r (K n) within 1. In doing so, we disprove a conjecture by Manoussakis, Spyratos, Tuza and Voigt in 4].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2001
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480198339456